A lattice path approach to counting partitionswith minimum
نویسندگان
چکیده
In this paper we give a combinatorial proof via lattice paths of the following result due to Andrews and Bressoud: for t 1, the number of partitions of n with all successive ranks at least t is equal to the number of partitions of n with no part of size 2 ? t. The identity is a special case of a more general theorem proved by Andrews and Bressoud using a sieve.
منابع مشابه
A path integral approach to lattice point problems
The main problem in (planar) lattice point theory consists in counting lattice points under the graph of positive functions supported on [0,M] and with radius of curvature comparable to M . We prove that, in some sense motivated by Feynman path integral formulation of Quantum Mechanics, for “most” functions the lattice error term in the area approximation is O(M1/2+ε). This complements Jarník c...
متن کاملEfficient Path Counting Transducers for Minimum Bayes-Risk Decoding of Statistical Machine Translation Lattices
This paper presents an efficient implementation of linearised lattice minimum Bayes-risk decoding using weighted finite state transducers. We introduce transducers to efficiently count lattice paths containing n-grams and use these to gather the required statistics. We show that these procedures can be implemented exactly through simple transformations of word sequences to sequences of n-grams....
متن کاملA lattice path approach to counting partitions with minimum rank t
In this paper, we give a combinatorial proof via lattice paths of the following result due to Andrews and Bressoud: for t6 1, the number of partitions of n with all successive ranks at least t is equal to the number of partitions of n with no part of size 2 − t. The identity is a special case of a more general theorem proved by Andrews and Bressoud using a sieve. c © 2002 Elsevier Science B.V. ...
متن کاملQuasi-birth-and-death Processes, Lattice Path Counting, and Hypergeometric Functions
In this paper we consider a class of quasi-birth-and-death processes for which explicit solutions can be obtained for the rate matrix R and the associated matrix G. The probabilistic interpretations of these matrices allow us to describe their elements in terms of paths on the two-dimensional lattice. Then determining explicit expressions for the matrices becomes equivalent to solving a lattice...
متن کاملA comparative analysis of the successive lumping and the lattice path counting algorithms
This article provides a comparison of the successive lumping (SL) methodology developed in [19] with the popular lattice path counting [24] in obtaining rate matrices for queueing models, satisfying the specific quasi birth and death structure as in [21], [22]. The two methodologies are compared both in terms of applicability requirements and numerical complexity by analyzing their performance ...
متن کامل